Anticipated behavior of long-step algorithms for linear programming
نویسنده
چکیده
We provide a probabilistic analysis of the second order term that arises in path-following algorithms for linear programming. We use this result to show that two such methods, algorithms generating a sequence of points in a neighborhood of the central path and in its relaxation , require a worst-case number of iterations that is O(nL) and an anticipated number of iterations that is O(log(n)L). The second neighborhood spreads almost all over the feasible region so that the generated points are close to the boundary rather than the central path. We also 0 propose a potential reduction algorithm which requires the same order of number of iterations as the path-following algorithms.
منابع مشابه
An Innovative Method for The Analysis of Structures with Tension-only Members
Due to their dual behavior under tension and compression, structures with tension-only members show non-linear behavior. To analize such structures, it is necessary to use a nonlinear analysis scheme. Nonlinear analysis methods generally use gradual loading techniques with/without modification of stiffness matrix of the structure. These methods, in addition to being time consuming algorithms, a...
متن کاملAn Innovative Method for The Analysis of Structures with Tension-only Members
Due to their dual behavior under tension and compression, structures with tension-only members show non-linear behavior. To analize such structures, it is necessary to use a nonlinear analysis scheme. Nonlinear analysis methods generally use gradual loading techniques with/without modification of stiffness matrix of the structure. These methods, in addition to being time consuming algorithms, a...
متن کاملFUZZY LINEAR PROGRAMMING WITH GRADES OF SATISFACTION IN CONSTRAINTS
We present a new model and a new approach for solving fuzzylinear programming (FLP) problems with various utilities for the satisfactionof the fuzzy constraints. The model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (DM), andallows for the assignment of distinct weights to the constraints and the objectivefunction. The desired solutio...
متن کاملDesign of single-sampling inspection-plan approach by mathematical programming and linear assignment method
This study proposes a new approach for single-sampling plan by determining sample size and acceptance number. The proposed approach is based on a two-step methodology. In the first step: quality management step, different single sampling inspection plans were generated by running an optimization model for different possible acceptance numbers. While, in the second step: Multi-Attribute Decision...
متن کامل